Segment Oriented Compression Scheme for MOLAP Based on Extendible Multidimensional Arrays

نویسندگان

  • Sk. Md. Masudul Ahsan
  • K. M. Azharul Hasan
چکیده

Many statistical and MOLAP applications use multidimensional arrays as the basic data structure to allow the efficient and convenient storage and retrieval of large volumes of business data for decision making. Allocation of data or data compression is a key performance factor for this purpose because performance strongly depends on the amount of storage required and availability of memory. This holds especially for data warehousing environments in which huge amounts of data have to be dealt with. The most evident consequence of data compression is that it reduces storage cost by packing more logical data per unit of physical capacity. And improved performance is a net outcome because less physical data need to be retrieved during scan-oriented queries. In this paper, an efficient data compression technique is proposed based on the notion of extendible array. The main idea of the scheme is to compress each of the segments of the extendible array using the position information only. We compare the proposed scheme for different performance issues with prominent compression schemes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Encoding Scheme to Handle the Address Space Overflow for Large Multidimensional Arrays

We present a new implementation scheme of multidimensional array for handling large scale high dimensional datasets that grows incrementally. The scheme implements a dynamic multidimensional extendible array employing a set of two dimensional extendible arrays. The multidimensional arrays provide many advantages but it has some problems as well. The Traditional Multidimensional array is not dyn...

متن کامل

Incremental Aggregation on MOLAP Cube Based on n-Dimensional Extendible Karnaugh Arrays

Data is increasing so rapidly that new data warehousing approaches are required to process and analyze data. Aggregation of data incrementally is needed to fast access of data and compute aggregation functions. Multidimensional arrays are generally used for this purpose. But some disadvantages such as address space requirement is large and processing time is comparatively slow in case of aggreg...

متن کامل

A New Parallel MOLAP Data Cube Construction Scheme

6 X MOLAP X &' ()* '+ X bcd Ne Z X mno • klp – t—˜ ™š › A New Parallel MOLAP Data Cube Construction Scheme Dong JIN, Tatsuo TSUJI, and Ken HIGUCHI † Graduate School of Engineering, University of Fukui Bunkyo 3–9–1, Fukui-shi, Fukui, 910–8507 Japan E-mail: †{jindong,tsuji}@pear.fuis.fukui-u.ac.jp, ††[email protected] Abstract The pre-computation of data cubes is critical for improving the re...

متن کامل

On the Performance of an Array-Based ADT for OLAP Workloads

There is currently a debate among OLAP vendors on the best way to provide OLAP functionality: Relational OLAP (ROLAP) vendors advocate using sophisticated front ends to provide a multidimensional view of a standard relational database, whereas Multidimensional OLAP (MOLAP) vendors provide custom servers that generally store their data as arrays (instead of tables.) An important question in this...

متن کامل

Efficient Data Compression Methods for Multidimensional Sparse Array Operations Based on the EKMR Scheme

In our previous work, we have proposed the extended Karnaugh map representation (EKMR) scheme for multidimensional array representation. In this paper, we propose two data compression schemes, EKMR Compressed Row/ Column Storage (ECRS/ECCS), for multidimensional sparse arrays based on the EKMR scheme. To evaluate the proposed schemes, we compare them to the CRS/CCS schemes. Both theoretical ana...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CIT

دوره 23  شماره 

صفحات  -

تاریخ انتشار 2015